Optimizing a linear function over the nondominated set of multiobjective integer programs
نویسندگان
چکیده
منابع مشابه
Optimizing a linear function over an integer efficient set
In this paper, a method for optimizing a linear function over the integer Pareto-optimal set without having to determine all integer efficient solutions is presented. The proposed algorithm is based on a simple selection technique that improves the linear objective value at each iteration. Two types of cuts are performed successively until the optimal value is obtained and the current truncated...
متن کاملA new method for optimizing a linear function over the efficient set of a multiobjective integer program
We present a new algorithm for optimizing a linear function over the set of efficient solutions of a multiobjective integer program MOIP. The algorithm’s success relies on the efficiency of a new algorithm for enumerating the nondominated points of a MOIP, which is the result of employing a novel criterion space decomposition scheme which (1) limits the number of subspaces that are created, and...
متن کاملFinding equidistant nondominated points for biobjective mixed integer programs
The nondominated frontier of a multiobjective optimization problem can be overwhelming to a decision maker, as it is often either exponential or infinite in size. Instead, a representation of this set in the form of a small sample of points is often preferred. In this paper we present a new biobjective criterion space search method for generating a small set of equidistant points based on the s...
متن کاملA mixed integer nonlinear programming model for optimizing a gas pipeline transmission linear network
The technical equipment developed and used in both installation and operation processes in refineries, oil and gas pipelines, and gas booster stations has always been expensive. Hence, managers at different organizational levels are keen to find methods to control and reduce these costs. Generally speaking, the operators in a gas booster station choose the operating devices without considering ...
متن کاملDecomposition of loosely coupled integer programs: A multiobjective perspective
We consider integer programming (IP) problems consisting of (possibly a large number of) subsystems and a small number of coupling constraints that link variables from different subsystems. Such problems are called loosely coupled or nearly decomposable. Motivated by recent developments in multiobjective programming (MOP), we develop a MOP-based decomposition algorithm to solve loosely coupled ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Transactions in Operational Research
سال: 2019
ISSN: 0969-6016,1475-3995
DOI: 10.1111/itor.12627